Evaluation of loadsharing algorithms for heterogeneous distributed systems
نویسندگان
چکیده
منابع مشابه
Adaptive Communication Algorithms for Distributed Heterogeneous Systems
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to enable network-aware communication at the application level. We present a uniform framework for developing adaptive communicationschedules for various collective communication patterns. Schedules are developed at run-...
متن کاملAdaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems
This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...
متن کاملDistributed Algorithms for Providing Fairness in Heterogeneous Computer Systems
Distributed computing systems often consist of heterogeneous computing resources managed by different administrators. Due to the distributed nature, effective management of the resources may become difficult and the performance of the system may be affected. Also, the users of distributed systems may be self-interested whose goal would be to maximize their own utility. Such selfinterested agent...
متن کاملEvaluation of connected-component labeling algorithms for distributed-memory systems
Connected component labeling is a key step in a wide-range of applications, such as community detection in social networks and coherent structure identification in massivelyparallel scientific simulations. There have been several distributed-memory connected component algorithms described in literature; however, little has been done regarding their scalability analysis. Theoretical and experime...
متن کاملEmpirical Evaluation of Mutual Exclusion Algorithms for Distributed Systems
Mutual exclusion in distributed memory systems is realized by passing messages among sites to establish a sequence for the waiting sites to enter the critical section. We have evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC 860 system, with their empirical results compared in terms of such criteria as the number of message exchanges and respon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 1999
ISSN: 0140-3664
DOI: 10.1016/s0140-3664(98)00262-x